Energy Efficient DVFS Scheduling for Mixed-Criticality Systems Pengcheng Huang, Pratyush Kumar, Georgia Giannopoulou, Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland first

Source URL: www.tik.ethz.ch

• Operations research
• Computational problems
• Mixed criticality
• Safety engineering
• Software engineering
• Systems engineering
• Power management
• Mathematical optimization
• Optimization problem
• Systems science
• Computing
• Systems theory

Uncertainty Feature Optimization: an Implicit Paradigm for Problems with Noisy Data Niklaus Eggenberg, Transport and Mobility Laboratory, EPFL Matteo Salani, Transport and Mobility Laboratory, EPFL Michel Bierlaire, Tran

Source URL: www.strc.ch

• Mathematical optimization
• Operations research
• Mathematical analysis
• Analysis
• Applied mathematics
• Stochastic programming
• Robust optimization
• Multi-objective optimization
• Constraint
• Linear programming
• Optimization problem
• Scenario optimization

Generic Rubric for Mathematical Processes Thinking Problem Solving Criteria Below Level 1

Source URL: www.edugains.ca

Low-Rank Solution of Convex Relaxation for Optimal Power Flow Problem Somayeh Sojoudi∗, Ramtin Madani+ and Javad Lavaei+ ∗ Department of Computing and Mathematical Sciences, California Institute of Technology +

Source URL: www.ieor.berkeley.edu

Stochastic Selfish Routing EVDOKIA NIKOLOVA Texas A&M University and NICOLAS STIER-MOSES Columbia University

Source URL: www.sigecom.org

• Game theory
• Price of anarchy
• Nash equilibrium
• Algorithmic game theory
• Shortest path problem
• Congestion game
• Economic equilibrium
• Routing
• Potential game
• Mathematical optimization
• Strategy

Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

Source URL: theory.stanford.edu

• Game theory
• Price of anarchy
• Approximation algorithm
• Mathematical optimization
• Epsilon-equilibrium
• Congestion game
• Optimization problem
• Computational complexity theory
• Nash equilibrium
• Mechanism design

A MAXIMUM b-MATCHING PROBLEM ARISING FROM MEDIAN LOCATION MODELS WITH APPLICATIONS TO THE ROOMMATES PROBLEM Arie Tamir Department of Statistics and Operations Research School of Mathematical Sciences

Source URL: www.ams.sunysb.edu

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

Perturbation Theory with Convergent Series: The Calculation of the λϕfield theory β-function The problem of series summation A typical problem: Let F (λ) be given by a formal power series ∞

Source URL: acat02.sinp.msu.ru

• Asymptotic analysis
• Divergent series
• Summability theory
• Spectral theory of ordinary differential equations
• Sturm–Liouville theory
• Mathematical analysis
• Calculus
• Spectral theory

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the d-Runaway Rectangle Escape Problem Aniket Basu Roy∗, Sathish Govindarajan∗, Neeldhara Misra∗, Shreyas Shetty∗ Abstract

Source URL: drona.csa.iisc.ernet.in

• Logic
• Quadrilaterals
• Rectangle
• Bin
• Algorithm
• Special case
• R-tree
• Hilbert R-tree
• Packing problem
• Mathematical logic
• Geometry
• Mathematics